Primality tests for $2^{p}\pm2^{(p+1)/2}+1$ using elliptic curves
نویسندگان
چکیده
منابع مشابه
Primality Proving Using Elliptic Curves: An Update
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the one hand, and Atkin on the other. The latter algorithm uses the theory of complex multiplication. The algorithm, now called ECPP, has been used for nearly ten years. The purpose of this paper is to give an account of th...
متن کاملDeterministic primality tests based on tori and elliptic curves
We develop a general framework for producing deterministic primality tests based on commutative group schemes over rings of integers. Our focus is on the cases of algebraic tori and elliptic curves. The proposed general machinery provides several series of tests which include, as special cases, tests discovered by Gross and by Denomme and Savin for Mersenne and Fermat primes, primes of the form...
متن کاملPrimality Proving with Elliptic Curves
Elliptic curves are fascinating mathematical objects. In this paper, we present the way they have been represented inside the COQ system, and how we have proved that the classical composition law on the points is internal and gives them a group structure. We then describe how having elliptic curves inside a prover makes it possible to derive a checker for proving the primality of natural number...
متن کاملElliptic Curves and Primality Proving
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, números primos a compositis dignoscendi, hosque in factores suos primos resolvendi, ad gravissima ac utilissima totius arithmeticae pertinere, et geometrarum turn veterum turn recentiorum industriam ac sagacitatem occupavisse, tarn notum est, ut de hac re copióse loqui...
متن کاملThe Uniform Primality Conjecture for Elliptic Curves
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang’s conjecture, and over the rational function field, unconditionally. In the latter case, a uniform bound is obtained on the index of a prime term. Sharpened versions of these techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2011
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2011-10839-6